Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
نویسندگان
چکیده
منابع مشابه
Analysis of Two Algorithms for Multi-objective Min-max Optimization
This paper presents two memetic algorithms to solve multi-objective min-max problems, such as the ones that arise in evidence-based robust optimization. Indeed, the solutions that minimize the design budgets are robust under epistemic uncertainty if they maximize the belief in the realization of the value of the design budgets. Thus robust solutions are found by minimizing with respect to the d...
متن کاملBisector Graphs for Min-/Max-Volume Roofs over Simple Polygons
Piecewise-linear terrains (“roofs”) over simple polygons were studied by Aichholzer et al. (1995) in their work on straight skeletons of polygons. We show how to construct a roof over a simple polygon that has minimum (or maximum) volume among all roofs that drain water. Such a maximum-volume (minimumvolume) roof can have quadratic (maybe cubic, resp.) number of facets. Our algorithm for comput...
متن کاملA Predictive Framework for Cyber Security Analytics using Attack Graphs
Security metrics serve as a powerful tool for organizations to understand the effectiveness of protecting computer networks. However majority of these measurement techniques don’t adequately help corporations to make informed risk management decisions. In this paper we present a stochastic security framework for obtaining quantitative measures of security by taking into account the dynamic attr...
متن کاملImproving CNN Performance with Min-Max Objective
In this paper, we propose a novel method to improve object recognition accuracies of convolutional neural networks (CNNs) by embedding the proposed Min-Max objective into a high layer of the models during the training process. The MinMax objective explicitly enforces the learned object feature maps to have the minimum compactness for each object manifold and the maximum margin between different...
متن کاملAn Evolution Strategy with Probabilistic Mutation for Multi-Objective Optimisation
Evolutionary algorithms have been applied with great success to the difficult field of multi-objective optimisation. Nevertheless, the need for improvements in this field is still strong. We present a new evolutionary algorithm, ESP (the Evolution Strategy with Probabilistic mutation). ESP extends traditional evolution strategies in two principal ways: it applies mutation probabilistically in a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2019
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2019.04.035